Building programmable jigsaw puzzles with RNA.
نویسندگان
چکیده
One challenge in supramolecular chemistry is the design of versatile, self-assembling building blocks to attain total control of arrangement of matter at a molecular level. We have achieved reliable prediction and design of the three-dimensional structure of artificial RNA building blocks to generate molecular jigsaw puzzle units called tectosquares. They can be programmed with control over their geometry, topology, directionality, and addressability to algorithmically self-assemble into a variety of complex nanoscopic fabrics with predefined periodic and aperiodic patterns and finite dimensions. This work emphasizes the modular and hierarchical characteristics of RNA by showing that small RNA structural motifs can code the precise topology of large molecular architectures. It demonstrates that fully addressable materials based on RNA can be synthesized and provides insights into self-assembly processes involving large populations of RNA molecules.
منابع مشابه
Gesture and Speech Input are Interlocking Pieces: The Development of Children's Jigsaw Puzzle Assembly Ability
Spatial reasoning ability is enhanced by spatial activities and spatial language. Spatial games (e.g., block building, assembling jigsaw puzzles) are often accompanied by spatial language, which, in turn, is often accompanied by co-speech gesture. Here we investigate the effects of spatial language and gesture in the context of puzzle play in improving preschool children’s puzzle assembly abili...
متن کاملJigsaw Puzzles As Cognitive Enrichment (PACE) - the effect of solving jigsaw puzzles on global visuospatial cognition in adults 50 years of age and older: study protocol for a randomized controlled trial
BACKGROUND Neurocognitive disorders are an important societal challenge and the need for early prevention is increasingly recognized. Meta-analyses show beneficial effects of cognitive activities on cognition. However, high financial costs, low intrinsic motivation, logistic challenges of group-based activities, or the need to operate digital devices prevent their widespread application in clin...
متن کاملNo Easy Puzzles: A Hardness Result for Jigsaw Puzzles
We show that solving jigsaw puzzles requires Θ(n ) edge matching comparisons, making them as hard as their trivial upper bound. This result generalises to puzzles of all shapes, and is applicable to both pictorial and apictorial puzzles.
متن کاملA Genetic Algorithm-Based Solver for Very Large Jigsaw Puzzles: Final Report
For this project, I implemented the genetic algorithm-based jigsaw puzzle solver described in “A Genetic Algorithm-Based Solver for Very Large Jigsaw Puzzles” by Sholomon et al [1]. This method involves producing a “child” solution from two “parent” solutions by detecting, extracting, and combining correctly assembled puzzle pieces. The solver developed by the paper’s team is able to accurately...
متن کاملJigsaw Puzzles, Edge Matching, and Polyomino Packing: Connections and ComplexityA preliminary version of this paper was presented at the Gathering for Gardner 6, Atlanta, March 2004
We show that jigsaw puzzles, edge-matching puzzles, and polyomino packing puzzles are all NP-complete. Furthermore, we show direct equivalences between these three types of puzzles: any puzzle of one type can be converted into an equivalent puzzle of any other type.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Science
دوره 306 5704 شماره
صفحات -
تاریخ انتشار 2004